Core problems in the bi - criteria { 0 , 1 } - knapsack : new developments ∗
نویسندگان
چکیده
The most efficient algorithms for solving the single-criterion {0,1}-knapsack problem are based on the concept of core, i.e., a small number of relevant variables. But this concept goes unnoticed when more than one criterion is taken into account. The main purpose of the paper is to check whether or not such a set of variables is present in bi-criteria {0-1}knapsack instances. Extensive numerical experiments have been performed considering five types of {0,1}-knapsack instances. The results are presented for supported, non-supported and for the entire set of efficient solutions. Key-words: Bi-criteria knapsack problem, Core problem, Combinatorial optimization ∗Also published as a research report of CEG-IST †Corresponding author
منابع مشابه
Core problems in bi-criteria {0, 1}-knapsack problems
The most efficient algorithms for solving the single-criterion {0, 1}-knapsack problem are based on the core concept (i.e., based on a small number of relevant variables). But this concept is not used in problems with more than one criterion. The main purpose of this paper is to validate the existence of such a set of variables in bi-criteria {0.1}-knapsack instances. Numerical experiments were...
متن کاملCore problems in the bi-criteria {0,1}-knapsack
The most e¢cient algorithms for solving single criterion {0,1}-knapsack problems are based on the core concept and the core problem. However, those concepts remain unnoticed in the multiple criteria case. In this paper we bring them to this topic. A large amount of e¢cient solutions are considered for analysing the importance of the core itself and the core problem. The results show that the pr...
متن کاملIntegrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems
This paper deals with the problem of inaccuracy of the solutions generated by metaheuristic approaches for bi-criteria {0,1}-knapsack problems. A hybrid approach which combines systematic and heuristic search is proposed to reduce that inaccuracy in the context of a scatter search method. The components of the method are used to determine regions in the decision space to be systematically searc...
متن کاملGeometrical con...guration of the Pareto frontier of bi-criteria {0,1}-knapsack problems
This paper deals with three particular models of the bi-criteria {0,1}-knapsack problem: equal weighted items, constant sum of the criteria coe¢cients, and the combination of the two previous models. The con...guration of the Pareto frontier is presented and studied. Several properties on the number and the composition of the e¢cient solutions are devised. The connectedness of the e¢cient solut...
متن کاملPareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem
This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for the Pareto bi-criteria optimization of the 0/1 knapsack problem. The main attention is focused on the incorporation of the Pareto optimality concept into classical structure of the BOA algorithm. We have modified the standard algorithm BOA for one criterion optimization utilizing the known niching techniques to...
متن کامل